On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection Cornelius Brand Saarland University and Cluster of Excellence (MMCI)∗ Michael Sagraloff

Source URL: people.mpi-inf.mpg.de

• Algebra
• Mathematics
• Homogeneous polynomials
• Matrix theory
• Polynomial
• Exponentiation
• Determinant

ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G

Source URL: www.math.lsa.umich.edu

• Mathematics
• Permutations
• Linear algebra
• Matrix theory
• Algebra
• Permanent
• Computing the permanent
• Permutation
• Hamiltonian path
• Tournament

POLYNOMIAL FUNCTIONS ON UPPER TRIANGULAR MATRIX ALGEBRAS SOPHIE FRISCH Abstract. There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in th

Source URL: blah.math.tu-graz.ac.at

719 PROCEEDINGS LETTERS terms involving one variable in an MV polynomial are fiied, the coefficients of the remaining terms in the polynomial are rigidly related to these, if the polynomial has to be separable.

Source URL: www-isl.stanford.edu

• Digital signal processing
• Mathematical analysis
• Bernard Widrow
• Artificial neural networks
• Filter theory
• Analysis
• Pi
• Matrix
• Adaptive filter
• 2D Adaptive Filters

Optimization on linear matrix inequalities for polynomial systems control

Source URL: jncf2013.imag.fr

R Foundations and Trends in Theoretical Computer Science Vol. 9, No–210 c 2014 S. Sachdeva and N. K. Vishnoi

Source URL: www.cs.yale.edu

• Mathematics
• Algebra
• Mathematical analysis
• Matrix theory
• NP-complete problems
• Numerical analysis
• Polynomial
• Approximation theory
• Pi
• Chebyshev polynomials
• Eigenvalues and eigenvectors
• Matrix

Improved algorithms for solving bivariate systems via Rational Univariate Representations Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier, Michael Sagraloff To cite this version:

Source URL: people.mpi-inf.mpg.de

• Mathematics
• Algebra
• Polynomials
• Computer algebra
• Resultant
• Polynomial
• Factorization
• Primitive part and content
• Greatest common divisor
• Irreducible polynomial
• Sylvester matrix
• Polynomial greatest common divisor

A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix with Nonnegative Entries MARK JERRUM University of Edinburgh, Edinburgh, United Kingdom ALISTAIR SINCLAIR

Source URL: www.cc.gatech.edu

1 Rank-2 Matrix Solution for Semidefinite Relaxations of Arbitrary Polynomial Optimization Problems Ramtin Madani, Ghazal Fazelnia and Javad Lavaei

Source URL: www.ieor.berkeley.edu

Low-Rank Solutions of Matrix Inequalities With Applications to Polynomial Optimization and Matrix Completion Problems Ramtin Madani, Ghazal Fazelnia, Somayeh Sojoudi and Javad Lavaei Abstract— This paper is concerned w

Source URL: www.ieor.berkeley.edu